Bucket brigade algorithm for hierarchical censored production rule-based system

Many learning systems face the problem of temporal credit allocation: the proper reinforcement of activities that do not directly result in need satisfaction or external reward but are nevertheless essential precursors to such outcomes [Wilson]. Therefore, the development of an appropriate credit apportionment scheme for adaptive rulebased systems is considered to be one of the main issues in machine learning (e.g., [1], [2], [22], [33], [42], [43], [46], [65], [66], [72], [74J, [75], [78],179], [80], [81], [83]). One well known algorithm in this regard is the bucket brigade algori thm of Holland [42], [43], which is basically designed for message-passing, rule-based classifier systems (genetic algorithms approach). De long [19] mentioned" I think it is fair to say that most people who encounter classifier systems after becoming familiar with the traditional genetic algorithms literature are some what surprised at the emergence of the rather elaborate (bucket brigade) mechanism to deal with apportionment of credit issues".